A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
نویسندگان
چکیده
منابع مشابه
A Conic Integer Programming Approach to Stochastic Joint Location-Inventory Problems
We study several joint facility location and inventory management problems with stochastic retailer demand. In particular, we consider cases with uncapacitated facilities, capacitated facilities, correlated retailer demand, stochastic lead times, and multicommodities. We show how to formulate these problems as conic quadratic mixed-integer problems. Valid inequalities, including extended polyma...
متن کاملA new approach for solving neutrosophic integer programming problems
Linear programming is one of the most important usages of operation research methods in real life, that includes of one objective function and one or several constraints which can be in the form of equality and inequality. Most of the problems in the real world are include of inconsistent and astute uncertainty, because of this reason we can’t obtain the optimal solution easily. In this paper, ...
متن کاملJoint Spectral Characteristics of Matrices: A Conic Programming Approach
We propose a new method to compute the joint spectral radius and the joint spectral subradius of a set of matrices. We first restrict our attention to matrices that leave a cone invariant. The accuracy of our algorithm, depending on geometric properties of the invariant cone, is estimated. We then extend our method to arbitrary sets of matrices by a lifting procedure, and we demonstrate the eff...
متن کاملA Stochastic Programming Duality Approach to Inventory Centralization Games
In this paper, we present a unified approach to study a class of cooperative games arising from inventory centralization. The optimization problems corresponding to the inventory games are formulated as stochastic programs. We observe that the strong duality of stochastic linear programming not only directly leads to a series of recent results concerning the non-emptiness of the cores of such g...
متن کاملA New Approach to Solve Multiple Objective Programming Problems
Multiple Objective Programming (MOP) problems have become famous among many researchers due to more practical and realistic implementations. There have been a lot of methods proposed especially during the past four decades. In this paper, we develop a new algorithm based on a new approach to solve MOP problems by starting from a utopian point (which is usually infeasible) and moving towards the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Operations Research
سال: 2012
ISSN: 0030-364X,1526-5463
DOI: 10.1287/opre.1110.1037